Beurling primes with large oscillation
نویسندگان
چکیده
منابع مشابه
Beurling primes with large oscillation
A Beurling generalized number system is constructed having integer counting function NB(x) = κx + O ( x ) with κ > 0 and 1/2 < θ < 1, whose prime counting function satisfies the oscillation estimate πB(x)= li(x)+ ( x exp (−c√log x), and whose zeta function has infinitely many zeros on the curve σ = 1 − a/ log t , t ≥ 2, and no zero to the right of this curve, where a is chosen so that a > (4/e)...
متن کاملBeurling Zeta Functions, Generalised Primes, and Fractal Membranes
We study generalised prime systems P (1 < p1 ≤ p2 ≤ · · · , with pj ∈ R tending to infinity) and the associated Beurling zeta function ζP(s) = ∏∞ j=1(1 − p−s j )−1. Under appropriate assumptions, we establish various analytic properties of ζP(s), including its analytic continuation and we characterise the existence of a suitable generalised functional equation. In particular, we examine the rel...
متن کاملMPQS with Three Large Primes
We report the factorization of a 135-digit integer by the triple-large-prime variation of the multiple polynomial quadratic sieve. Previous workers [6][10] had suggested that using more than two large primes would be counterproductive, because of the greatly increased number of false reports from the sievers. We provide evidence that, for this number and our implementation, using three large pr...
متن کاملFactoring With Two Large Primes
We describe a modification to the well-known large prime variant of the multiple polynomial quadratic sieve factoring algorithm. In practice this leads to a speed-up factor of 2 to 2.5. We discuss several implementation-related aspects, and we include some examples. Our new variation is also of practical importance for the number field sieve factoring algorithm. 1. Factoring with two large prim...
متن کاملLarge Sophie Germain primes
If P is a prime and 2P+1 is also prime, then P is a Sophie Germain prime. In this article several new Sophie Germain primes are reported, which are the largest known at this time. The search method and the expected search times are discussed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematische Annalen
سال: 2005
ISSN: 0025-5831,1432-1807
DOI: 10.1007/s00208-005-0638-2